A note on the random greedy independent set algorithm
نویسندگان
چکیده
منابع مشابه
A note on the random greedy independent set algorithm
Let r be a fixed constant and let H be an r-uniform, D-regular hypergraph on N vertices. Assume further that D > N ǫ for some ǫ > 0. Consider the random greedy algorithm for forming an independent set in H. An independent set is chosen at random by iteratively choosing vertices at random to be in the independent set. At each step we chose a vertex uniformly at random from the collection of vert...
متن کاملA note on the random greedy triangle-packing algorithm
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the edges of triangles one at a time, where each triangle removed is chosen uniformly at random from the collection of all remaining triangles. This stochastic process terminates once it arrives at a triangle-free graph. In ...
متن کاملA note on greedy algorithms for the maximum weighted independent set problem
In this paper, we consider three simple and natural greedy algorithms for the Maximum Weighted Independent Set problem. We show that two of them output an independent set of weight P v2V (G) W (v) d(v)+1 and the other outputs an independent set of weight P v2V (G) W (v) 2 P u2N + G (v) W (u) . Those results are generalization of Tur an's theorem.
متن کاملA note on random greedy coloring of uniform hypergraphs
The smallest number of edges forming an n-uniform hypergraph which is not r-colorable is denoted by m(n, r). Erdős and Lovász conjectured thatm(n, 2) = θ (n2n). The best known lower boundm(n, 2) = Ω (√ n/ logn2n ) was obtained by Radhakrishnan and Srinivasan in 2000. We present a simple proof of their result. The proof is based on analysis of random greedy coloring algorithm investigated by Plu...
متن کاملA Note on Independent Random Oracles
It is shown that P A P B BPP holds for every algorithmically random oracle A B This result extends the corresponding probability one characterization of Ambos Spies and Kurtz
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2016
ISSN: 1042-9832
DOI: 10.1002/rsa.20667